suffix tree
英 [ˈsʌfɪks triː]
美 [ˈsʌfɪks triː]
网络 后缀树; 后缀树实现; 后继树
双语例句
- Implementation of Chinese and English Clustering Engine Based on Improved Suffix Tree Algorithm
基于改进后缀树算法中英文聚类引擎的实现 - Suffix Tree Based Label Generation Method for Web Search Results Clustering
基于后缀树的Web检索结果聚类标签生成方法 - To improve the clustering efficiency, a simple but reasonable measure for base cluster selection is presented to exclude some generalized suffix tree nodes which contribute less to the clustering.
为了进一步提高聚类效率，给出了一种简单有效的用于基类选择的测度，用来排除一些无意义的广义后缀树节点。 - In order to improve the updating speed, it makes use of non-compact suffix tree to incrementally insert the new user request and delete the outdated browsing information.
该模型仅保留处于滑动窗口之内的最近访问序列，从而反映用户兴趣的变化，同时利用非压缩后缀树增量式添加新的用户请求和删除过时的浏览信息，以提高更新速度。 - It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。 - An Improved Text Clustering Algorithm of Generalized Suffix Tree
一种改进的基于广义后缀树的文本聚类算法 - At the same time, by adopting the zoning searching method the algorithm constructs a suffix tree for each frequent page node, and then mines continuous frequent access paths by visiting the tree.
同时采用分区搜索的方式，为每个频繁节点构造一棵后缀树，通过遍历该后缀树挖掘出连续频繁访问路径。 - For example: the path expression template-match method, the structural joins based on B+ tree method, the suffix tree index method, recoding path expression into a special index method and utilizing XML schema to optimize path expression method, etc.
例如：路径表达式模板匹配方法、基于B+树的结构联合方法、基于后缀树的索引方法、路径表达式重写索引查询方法、利用XML模板优化查询路径的方法等。 - The paper has discussed a text clustering algorithm based on suffix tree, named STC. After analyzing some flaws of this algorithm, a more effective approach based on PAT-array and Fuzzy clustering is proposed in order to improve the quality of clustering.
阐述了基于后缀树的文本聚类（STC）算法，对其所存在的缺陷进行了分析，并在此基础上提出了采用PAT-array和模糊聚类相结合的方法对其进行的改进，以提高聚类的质量。 - Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。 - A Spam Detection Method on Backbone Network Based on Suffix Tree
基于后缀树的骨干网络垃圾邮件检测方法 - Research of a Suffix Tree Based Automatic Wrapper Generation Method
一种基于后缀树的包装器自动生成方法的研究 - Based on these criterions it takes three document clustering algorithms for assessment with experiments. The comparison and analysis show that STC ( Suffix Tree Clustering) algorithm is better than k-Means and Ant-based clustering algorithms.
在此基础上选择k-Means聚类算法、STC（后缀树聚类）算法和基于Ant的聚类算法进行了实验对比。 - We present a quick method to mine the frequent path and the reachable set and probability of web pages browsed by users based on the suffix tree;
给出了基于后缀树用户浏览频繁路径、页面可达集和可达概率的快速计算方法； - According to different storage methods of child suffix tree, we introduce several searching technology.
根据不同的子后缀树存储方法，本文介绍了多种搜索方法。 - This thesis mainly focuses on the study of suffix tree index technical dealing with bio-sequences and multiple sequences alignment problem in bioinformatics.
本文主要对适用于生物序列数据上的后缀树索引技术和生物信息学中的多序列比对算法进行了分析和研究。 - Faced to network content security, we review other representation method and propose a representation method based on suffix tree model ( STM).
本文面向网络信息内容分析这一背景，针对流数据处理中的流文本表示问题，考察了现有的文本表示方法，提出并实现了基于后缀树模型（STM）的流文本表示方法。 - While the data type of input data is a string type, this paper realized a statistical method based on general general suffix tree model for frequent string.
对输入数据的类型为字符型的聚合函数，实现了一种基于通用后缀树（GST）表示的字符串频率统计方法。 - Second, general suffix tree algorithm is used to mine the key path from user's all navigation paths, and using key path to cluster all users into different interest groups.
其次，提出从导航路径中利用构造复合后缀树的方法来挖掘用户关键路径，并利用关键路径将用户聚类成不同的兴趣群。 - The second part includes the index of child suffix tree, and some other information for finding the location of every child suffix tree in disk quickly.
第二部分是索引部分，包括子后缀树的索引和其他信息。利用这部分信息，可以快速定位每棵子后缀树在磁盘中的位置。 - High-frequency words extracting algorithm based on suffix tree is used to extract content features of items and the use of thesaurus can be avoided.
采用基于前缀树的高频词抽取算法抽取试题的内容特征，避免了对同义词典的依赖。 - SHOC, Lingo algorithm that combined vector space model ( VSD Model) and the suffix tree document model not only considering the words of the location information, but also consider the statistical properties of words, had the good development in the STC foundation.
SHOC、Lingo算法将向量空间模型（VSDModel）与后缀树文档表示模型结合起来，既考虑了词的位置信息，又考虑词的统计特性，在STC的基础上有了较好的发展。 - The pruning suffix tree combines the suffix tree which has suffix chain and the trie-tree which computing the kernel value in the leaf. But it uses less space than suffix tree and computes faster than the trie-tree.
剪枝后缀树结合了后缀树的后缀链思想以及trie-树在根结点计算核值的方法，具有比后缀树更少的空间以及比trie-树更快的时间。 - Based on the research of these algorithms` design and the analysis of their performance, a pair-wise sequence alignment algorithm based on suffix tree is implemented.
在对这些算法的设计思想进行研究、性能进行比较分析的基础上，提出了基于后缀树的双序列比对算法SPLSA。 - In order to enhance the efficiency of the algorithm, the suffix tree was improved. The leaf lists are stored in internal nodes of suffix tree.
为了进一步提高算法的效率，我们对后缀树进行了改进，给中间节点加入了叶子信息数组，这样就避免了算法对子树的遍历。 - When the data file is processed beforehand, the thesis proposes three types of index, basic suffix tree index, optimal suffix tree index and cluster index.
在索引数据文件的情况下，本文提出了三种索引结构，基于基本后缀树的索引、基于扩展后缀树的索引和基于聚类的索引。 - There are three major steps: establish suffix tree, search for common strings and link common strings.
该算法分为三个主要步骤&建立后缀树，寻找公共子串，连接公共子串。 - Using a suffix tree as input which is constructed by DNA sequences and a search algorithm which is base on suffix trees as measure, this method outputs a classified table of element repeats finally.
算法以DNA序列所构造的后缀树作为输入，并以基于后缀树的查询算法作为手段，最终生成输入的DNA序列的初级重复体分类表。 - The vague kernel also improves the speed of matching characters using the pruning suffix tree. Finally, we designed and realized a classification model for protein.
而在模糊谱核的计算上，同样利用了剪枝后缀树提高了字符匹配的速度。 - Subsequently, we analyzed the design, selection and computation of the sample kernel for different applications. ( 2) For the computing of the string kernel, we designed and adopted a data structure called pruning suffix tree.
随后，本文针对不同应用下样本核的设计、选取以及计算简要做了分析。（2）在针对串核的计算方法上，本文设计并采用了一种称为剪枝后缀树的数据结构。